Generating triangulations on closed surfaces with minimum degree at least 4
نویسندگان
چکیده
We show that every triangulation on a closed surface, except the sphere, with minimum degree at least 4 can be obtained from an irreducible triangulation by two kinds of local deformations, called 4-splitting and addition of an octahedron and that every triangulation on the sphere can be obtained from the octahedron by them. c © 2002 Elsevier Science B.V. All rights reserved.
منابع مشابه
. C O ] 1 5 Ju l 2 01 5 Generating families of surface triangulations . The case of punctured surfaces with inner degree at least 4
We present two versions of a method for generating all triangulations of any punctured surface in each of these two families: (1) triangulations with inner vertices of degree ≥ 4 and boundary vertices of degree ≥ 3 and (2) triangulations with all vertices of degree ≥ 4. The method is based on a series of reversible operations, termed reductions, which lead to a minimal set of triangulations in ...
متن کاملA Fast Algorithm for Computing Irreducible Triangulations of Closed Surfaces in E and Its Application to the TriQuad Problem
Let S be a compact surface with empty boundary. A classical result from the 1920s by Tibor Radó asserts that every compact surface with empty boundary (usually called a closed surface) admits a triangulation [1]. Let e be any edge of a triangulation T of S . The contraction of e in T consists of contracting e to a single vertex and collapsing each of the two triangles meeting e into a single ed...
متن کاملk-NORMAL SURFACES
Following Matveev, a k-normal surface in a triangulated 3-manifold is a generalization of both normal and (octagonal) almost normal surfaces. Using spines, complexity, and Turaev-Viro invariants of 3-manifolds, we prove the following results: • a minimal triangulation of a closed irreducible or a bounded hyperbolic 3-manifold contains no non-trivial k-normal sphere; • every triangulation of a c...
متن کاملGenerating Rooted Triangulations with Minimum Degree Four
A graph is a triangulation if it is planar and every face is a triangle. A triangulation is rooted if the external triangular face is labelled. Two rooted triangulations with the same external face labels are isomorphic if their internal vertices can be labelled so that both triangulations have identical edge lists. In this article, we show that in the set of rooted triangulations on n points w...
متن کاملOn Triangulations with High Vertex Degree
We solve three enumerative problems concerning the families of planar maps. More precisely, we establish algebraic equations for the generating function of loopless triangulations in which all vertices have degree at least d, for a certain value d chosen in {3, 4, 5}. The originality of the problem lies in the fact that degree restrictions are placed both on vertices and faces. Our proofs first...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 244 شماره
صفحات -
تاریخ انتشار 2002